Biological taxonomy and ontology development: scope and limitations

The prospects of integrating full-blown biological taxonomies into an ontological reasoning framework are reviewed. We contrast the common usage of a static 'snapshot' hierarchy in ontological representations of taxonomy with a more realistic situation that involves dynamic, piece-meal revisions of particular taxonomic groups and requires alignment with relevant preceding perspectives. Taxonomic practice is characterized by a range of phenomena that are orthogonal to the logical semantic background from which ontological entities and relationships originate, and therefore pose special challenges to ontological representation and reasoning. Among these phenomena are: (1) the notion that there is a single phylogenetic hierarchy in nature which taxonomy can only gradually approximate; (2) the evolvability of taxa which means that taxon-defining features may be lost in subordinate members or independently gained across multiple sections of the tree of life; (3) the hybrid approach of defining taxa both in reference to properties (intensional) and members (ostensive) which undermines the individual/class dichotomy sustaining conventional ontologies; (4) the idiosyncratic yet inferentially valuable usage of Linnaean ranks; (5) the indelible and semantically complex 250-year legacy of nomenclatural and taxonomic changes that characterizes the current system; (6) the insufficient taxonomic exploration of large portions of the tree of life; and the need to use a sophisticated terminology for aligning taxonomic entities in order to integrate both (7) single and (8) multiple hierarchies. We briefly such how such integration may proceed based on an initial expert alignment of concept relationship and subsequent use of first-order logic algorithms to maximize consistency, reveal implied relationships, and ultimately merge taxonomies.
 In light of the aforementioned obstacles, we suggest that research along the taxonomy/ontology interface should focus on either strictly nomenclatural entities or specialize in ontology-driven methods for producing alignments between multiple taxonomies. We furthermore suggest that the prospects of developing successful ontologies for taxonomy will largely depend on the ability of the taxonomic expert community to present their phylogenies and classifications in a way that is more compatible with ontological reasoning than concurrent practice. Minimally, this means (1) adopting rigorous standards for linking new core taxonomies to relevant peripheral taxonomies through comprehensive alignments so that their ontological/taxonomic connections are transparent; (2) using lineage-specific ontological standards for phenotype-based accounts of taxa while taking into account the phylogenetic contextuality of phenotypic descriptors; (3) presenting all nomenclatural and taxonomic novelties in an explicit, ontology-compatible format, including intensional and ostensive definitions; and (4) offering comprehensive intensional/ostensive alignments to entities in relevant preceding taxonomies

A Brief Overview of the NEBULA Future Internet Architecture

NEBULA is a proposal for a Future Internet Architecture. It is based on the assumptions that: (1) cloud computing will comprise an increasing fraction of the application workload offered to an Internet, and (2) that access to cloud computing resources will demand new architectural features from a network. Features that we have identified include dependability, security, flexibility and extensibility, the entirety of which constitute resilience.NEBULA provides resilient networking services using ultrareliable routers, an extensible control plane and use of multiple paths upon which arbitrary policies may be enforced. We report on a prototype system, Zodiac, that incorporates these latter two features

Satisfying Individual Desires or Moral Standards? Preferential Treatment and Group Members' Self-Worth, Affect, and Behavior

We investigate how social comparison processes in leader treatment quality impact group members' self-worth, affect, and behavior. Evidences from the field and the laboratory suggest that employees who are treated kinder and more considerate than their fellow group members experience more self-worth and positive affect. Moreover, the greater positive self-implications of preferentially treated group members motivate them more strongly to comply with norms and to engage in tasks that benefit the group. These findings suggest that leaders face an ethical trade-off between satisfying the moral standard of treating everybody equally well and satisfying individual group members' desire to be treated better than others

On the Feasibility of Peer-to-Peer Web Indexing and Search

This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of queries over an overlay network (as in Gnutella), and intersection of index lists stored in a distributed hash table. We present a simple feasibility analysis based on the resource constraints and search workload. Our study suggests that the peer-to-peer network does not have enough capacity to make naive use of either of search techniques attractive for Web search. The paper presents a number of existing and novel optimizations for P2P search based on distributed hash tables, estimates their effects on performance, and concludes that in combination these optimizations would bring the problem to within an order of magnitude of feasibility. The paper suggests a number of compromises that might achieve the last order of magnitude

Declarative Networking: Language, Execution and Optimization

The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for a next-generation Internet architecture. In this context, we have investigated declarative networking: the use of a distributed recursive query engine as a powerful vehicle for accelerating innovation in network architectures [23, 24, 33]. Declarative networking represents a significant new application area for database research on recursive query processing. In this paper, we address fundamental database issues in this domain. First, we motivate and formally define the Network Datalog (NDlog) language for declarative network specifications. Second, we introduce and prove correct relaxed versions of the traditional semi-naïve query evaluation technique, to overcome fundamental problems of the traditional technique in an asynchronous distributed setting. Third, we consider the dynamics of network state, and formalize the “eventual consistency ” of our programs even when bursts of updates can arrive in the midst of query execution. Fourth, we present a number of query optimization opportunities that arise in the declarative networking context, including applications of traditional techniques as well as new optimizations. Last, we present evaluation results of the above ideas implemented in our P2 declarative networking system, running on 100 machines over the Emulab network testbed. 1

Declarative Networking: Language, Execution and Optimization

The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for a next-generation Internet architecture. In this context, we have investigated declarative networking: the use of a distributed recursive query engine as a powerful vehicle for accelerating innovation in network architectures [23, 24, 33]. Declarative networking represents a significant new application area for database research on recursive query processing. In this paper, we address fundamental database issues in this domain. First, we motivate and formally define the Network Datalog (NDlog) language for declarative network specifications. Second, we introduce and prove correct relaxed versions of the traditional semi-na ve query evaluation technique, to overcome fundamental problems of the traditional technique in an asynchronous distributed setting. Third, we consider the dynamics of network state, and formalize the "eventual consistency" of our programs even when bursts of updates can arrive in the midst of query execution. Fourth, we present a number of query optimization opportunities that arise in the declarative networking context, including applications of traditional techniques as well as new optimizations. Last, we present evaluation results of the above ideas implemented in our P2 declarative networking system, running on 100 machines over the Emulab network testbed

Planning for change: conservation-related impacts of climate overshoot

The Intergovernmental Panel on Climate Change's (IPCC) special report on global warming of 1.5 degrees Celsius (degrees C) makes clear that most scenarios (90%) that hold warming to 1.5 degrees C by 2100 include an overshoot, or a period in which the temperature increase exceeds 1.5 degrees C before declining to the end-of-century 1.5 degrees C goal (IPCC 2018). An overshoot is also possible for 2 degrees C scenarios, given the lack of ambition in existing mitigation commitments. Current conservation policy and planning does not adequately account for the high likelihood of a temperature overshoot in a 1.5 degrees C scenario, but the impacts of an overshoot on conservation may be large. Efforts to avoid an overshoot must be increased through more ambitious mitigation commitments and a greater focus on peak warming rather than end-of-century outcomes. Simultaneously, conservation planning should account for such impacts by anticipating more dynamic systems that carry greater uncertainties and potentially irreversible changes that may persist even as temperatures peak and decline